Real - Time State Machines
نویسنده
چکیده
منابع مشابه
Diffusion Process for GGR Machining System with Spares, Balking and Reneging (RESEARCH NOTE)
This paper deals with the G/G/R machining system consisting of M operating machines as well as S cold standbys. The concepts of balking and reneging are incorporated which make our model more versatile to deal with real time systems. The broken-down machines are sent to repair facilities consisting of R permanent repairmen. The failure times and repair times are generally identical and independ...
متن کاملIn Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays
We define a notion of implementation for real-time Abstract State Machines (ASM) with instantaneous actions by machines with delayed actions. The time is continuous, and time constraints are metric. It is clear that not every machine of the first type can be implemented by a machine of the second type. We describe sufficient conditions on ASM that permit to construct such an implementation in a...
متن کاملN-Policy for M/G/1 Machine Repair Model with Mixed Standby Components, Degraded Failure and Bernoulli Feedback
In this paper, we study N-policy for a finite population Bernoulli feedback queueing model for machine repair problem with degraded failure. The running times of the machines between breakdowns have an exponential distribution. The repair times of the machines are independent and identically distributed random variables. If at any time a machine fails, it is sent to the repairman for repairing,...
متن کاملA (more) Formal Denition of Communicating Real-time State Machines 3
The language of communicating real-time state machines is de ned precisely in three parts. First, the syntax of a single machine and of a set of connected machines are described. Then, the static semantics is described as the set of execution paths obtained through a static analysis. Finally, the dynamic semantics is de ned by specifying a simulation algorithm that produces execution traces or ...
متن کاملReentrant Statecharts for Concurrent Real-Time Systems
In this paper, we present novel notions of reentrant state machines and reentrant statecharts, which are extensions of traditional state machines and statecharts with the addition of concurrent syntax and semantics. Reentrant state machines can provide efficient concurrency support for statechart-based real-time tasks by interleaving the execution of concurrent tasks. With its well-defined synt...
متن کاملOn Implementations of Instantaneous Actions Real-Time ASM by ASM with Delays
We define a notion of implementation for real-time Abstract State Machines (ASM) with instantaneous actions by machines with delayed actions. The time is continuous, and time constraints are metric. It is clear that not every machine of the first type can be implemented by a machine of the second type. We describe sufficient conditions on ASM that permit to construct such an implementation in a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1993